منابع مشابه
Global Cycle Properties in Graphs with Large Minimum Clustering Coefficient
Let P be a graph property. A graph G is said to be locally P (closed locally P) if the subgraph induced by the open neighbourhood (closed neighbourhood, respectively) of every vertex in G has property P. The clustering coefficient of a vertex is the proportion of pairs of its neighbours that are themselves neighbours. The minimum clustering coefficient of G is the smallest clustering coefficien...
متن کاملthe clustering and classification data mining techniques in insurance fraud detection:the case of iranian car insurance
با توجه به گسترش روز افزون تقلب در حوزه بیمه به خصوص در بخش بیمه اتومبیل و تبعات منفی آن برای شرکت های بیمه، به کارگیری روش های مناسب و کارآمد به منظور شناسایی و کشف تقلب در این حوزه امری ضروری است. درک الگوی موجود در داده های مربوط به مطالبات گزارش شده گذشته می تواند در کشف واقعی یا غیرواقعی بودن ادعای خسارت، مفید باشد. یکی از متداول ترین و پرکاربردترین راه های کشف الگوی داده ها استفاده از ر...
Clustering Large Data Sets with Mixed Numeric and Categorical Values
Efficient partitioning of large data sets into homogenous clusters is a fundamental problem in data mining. The standard hierarchical clustering methods provide no solution for this problem due to their computational inefficiency. The k-means based methods are promising for their efficiency in processing large data sets. However, their use is often limited to numeric data. In this paper we pres...
متن کاملClustering function: another view on clustering coefficient
Assuming that actors u and v have r common neighbors in a social network we are interested in how likely is that u and v are adjacent. This question is addressed by studying the collection of conditional probabilities, denoted cl(r), r = 0, 1, 2, . . . , that two randomly chosen actors of the social network are adjacent, given that they have r common neighbors. The function r → cl(r) describes ...
متن کاملApproximating Clustering Coefficient and Transitivity
Since its introduction in the year 1998 by Watts and Strogatz, the clustering coefficient has become a frequently used tool for analyzing graphs. In 2002 the transitivity was proposed by Newman, Watts and Strogatz as an alternative to the clustering coefficient. As many networks considered in complex systems are huge, the efficient computation of such network parameters is crucial. Several algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2018
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.08.020